The rook problem on saw-toothed chessboards

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The rook problem on saw-toothed chessboards

A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j) can dominate the squares in row i and in column j . The rook problem of an STC is to determine the minimum number of rooks that can dominate all squares of the STC. In this paper, we model an STC by two particular gra...

متن کامل

The Inverse Rook Problem on Ferrers Boards

Rook polynomials have been studied extensively since 1946, principally as a method for enumerating restricted permutations. However, they have also been shown to have many fruitful connections with other areas of mathematics, including graph theory, hypergeometric series, and algebraic geometry. It is known that the rook polynomial of any board can be computed recursively. [19, 18] The naturall...

متن کامل

Balanced Black and White Coloring Problem on knights chessboards

Graph anticoloring problem is partial coloring problem where the main feature is the opposite rule of the graph coloring problem, i.e., if two vertices are adjacent, their assigned colors must be the same or at least one of them is uncolored. In the same way, Berge in 1972 proposed the problem of placing b black queens and w white queens on a n× n chessboard such that no two queens of different...

متن کامل

A problem of arrangements on chessboards and generalizations

For a unified approach to the study of the distributions of like objects on chessboards, the numbers defined by where A, denotes the partial Cwith respect to u) difference operator, are examined. This approach facilitates the treatment of further generalizations of such problems.

متن کامل

Rook numbers and the normal ordering problem

Abstract. For an element w in the Weyl algebra generated by D and U with relation DU = UD + 1, the normally ordered form is w = ∑ ci,jU D . We demonstrate that the normal order coefficients ci,j of a word w are rook numbers on a Ferrers board. We use this interpretation to give a new proof of the rook factorization theorem, which we use to provide an explicit formula for the coefficients ci,j ....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2008

ISSN: 0893-9659

DOI: 10.1016/j.aml.2007.12.003